Size minimization and approximating problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Size Minimization and Approximating Problems

We consider Plateau type variational problems related to the size minimization of recti able currents. We realize the limit of a size minimizing sequence as a stationary varifold and a minimal set. Other examples of functionals to be minimized include the integral over the underlying carrying set of a power q of the multiplicity function, with 0 < q 1. Because minimizing sequences may have unbo...

متن کامل

Algorithms for Approximating Minimization Problems

In this paper, we study the following minimization problem

متن کامل

Hardness of Approximating p2 Minimization Problems

We show that a number of natural optimization problems in the second level of the Polynomial Hierarchy are p2-hard to approximate to within n factors, for specific > 0. The main technical tool is the use of explicit dispersers to achieve strong, direct inapproximability results. The problems we consider include Succinct Set Cover, Minimum Equivalent DNF, and other problems relating to DNF minim...

متن کامل

Approximating Marginals Using Discrete Energy Minimization

We consider the problem of inference in a graphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete Marginals technique in which approximate margin...

متن کامل

Approximating Clique and Biclique Problems

We present here 2-approximation algorithms for several node deletion and edge deletion biclique problems and for an edge deletion clique problem. The biclique problem is to find a node induced subgraph that is bipartite and complete. The objective is to minimize the total weight of nodes or edges deleted so that the remaining subgraph is bipartite complete. Several variants of the biclique prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Calculus of Variations and Partial Differential Equations

سال: 2003

ISSN: 0944-2669,1432-0835

DOI: 10.1007/s00526-002-0177-6